منابع مشابه
Faces of Birkhoff Polytopes
The Birkhoff polytope Bn is the convex hull of all (n×n) permutation matrices, i.e., matrices where precisely one entry in each row and column is one, and zeros at all other places. This is a widely studied polytope with various applications throughout mathematics. In this paper we study combinatorial types L of faces of a Birkhoff polytope. The Birkhoff dimension bd(L) of L is the smallest n s...
متن کاملBoolean quadric polytopes are faces of linear ordering polytopes
Let PBQP(n) be a boolean quadric polytope, n ∈ N, PLO(m) — linear ordering polytope, m ∈ N. It is shown that PBQP(n) is linearly isomorphic to a face of PLO(2n). 1 Введение Булевы квадратичные многогранники PBQP(n), n ∈ N, возникают, в первую очередь, в контексте поиска эффективных решений для задачи квадратичного 0/1программирования, где n — число 0/1-переменных. Изучению их свойств, а также с...
متن کاملLinear Programming, the Simplex Algorithm and Simple Polytopes
In the first part of the paper we survey some far reaching applications of the basis facts of linear programming to the combinatorial theory of simple polytopes. In the second part we discuss some recent developments concurring the simplex algorithm. We describe sub-exponential randomized pivot roles and upper bounds on the diameter of graphs of polytopes.
متن کاملSimple 0/1-Polytopes
For general polytopes, it has turned out that with respect to many questions it su ces to consider only the simple polytopes, i.e., d-dimensional polytopes where every vertex is contained in only d facets. In this paper, we show that the situation is very di erent within the class of 0/1-polytopes, since every simple 0/1-polytope is the (cartesian) product of some 0/1-simplices (which proves a ...
متن کاملSimple Extensions of Polytopes
We introduce the simple extension complexity of a polytope P as the smallest number of facets of any simple (i.e., non-degenerate in the sense of linear programming) polytope which can be projected onto P . We devise a combinatorial method to establish lower bounds on the simple extension complexity and show for several polytopes that they have large simple extension complexities. These example...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2004
ISSN: 0012-365X
DOI: 10.1016/j.disc.2004.02.006